Playing cards with Hintikka An introduction to dynamic epistemic logic
نویسندگان
چکیده
منابع مشابه
Playing cards with Hintikka An introduction to dynamic epistemic logic
This contribution is a gentle introduction to so-called dynamic epistemic logics, that can describe how agents change their knowledge and beliefs. We start with a concise introduction to epistemic logic, through the example of one, two and finally three players holding cards; and, mainly for the purpose of motivating the dynamics, we also very summarily introduce the concepts of general and com...
متن کاملKnowledge, Time, and Paradox
Epistemic logic in the tradition of Hintikka provides, as one of its many applications, a toolkit for the precise analysis of certain epistemological problems. In recent years, dynamic epistemic logic has expanded this toolkit. Dynamic epistemic logic has been used in analyses of well-known epistemic “paradoxes”, such as the Paradox of the Surprise Examination and Fitch’s Paradox of Knowability...
متن کاملConcurrent information update in multi-agent systems: from Hintikka to Abramsky Games
Abramsky and Hintikka style games can be seen as representatives of the two main branches of game semantics. They both model interaction but each in a different manner. Hintikka games provide models of propositional interaction in terms of classical logic connectives such as ∨, ∧, →, and ¬. Abramsky games, on the other hand, model the interaction between programs that run in different parallel ...
متن کاملLogics of Informational Attitudes and Informative Actions
There is an extensive literature focused on using logical methods to reason about communities of agents engaged in some form of social interaction. Much of the work builds upon existing logical frameworks developed by philosophers and computer scientists incorporating insights and ideas from philosophy (especially epistemology and philosophy of action), game theory, decision theory and social c...
متن کاملTableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge
We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multiagent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for CMAEL(CD) and prove that satisfiability in such structures is equivalent to satisfiabil...
متن کامل